package leetcode.N1201_N1300;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.List;

/**
 * @author xiwai [hww282306@alibaba-inc.com]
 * @version 1.0
 * @date 2020/10/26 8:56 下午
 */
public class N1365 {


    public static void main(String[] args) {
        System.out.println(0xffff);
    }

    public int[] smallerNumbersThanCurrent(int[] nums) {
        int length = nums.length;
        List<Integer> numsArray = new ArrayList<>(length);
        int[] numsCount = new int[length];
        for (int num : nums) {
            numsArray.add(num);
        }
        Collections.sort(numsArray);
        for (int i = 0; i < nums.length; i++) {
            numsCount[i] = numsArray.indexOf(nums[i]);
        }
        return numsCount;
    }


}
